Successive Convex Approximation Algorithms for Sparse Signal Estimation With Nonconvex Regularizations
نویسندگان
چکیده
منابع مشابه
Parallel Successive Convex Approximation for Nonsmooth Nonconvex Optimization
Consider the problem of minimizing the sum of a smooth (possibly non-convex) and a convex (possibly nonsmooth) function involving a large number of variables. A popular approach to solve this problem is the block coordinate descent (BCD) method whereby at each iteration only one variable block is updated while the remaining variables are held fixed. With the recent advances in the developments ...
متن کاملsignal specific successive approximation analog to digital converter
چکیده: در میان انواع متفاوتی از مبدل های آنالوگ به دیجیتال که تا کنون معرفی شده اند، مبدل های آنالوگ به دیجیتال تقاریب متوالی(sar ) به علت سادگی ساختار و همچنین توان مصرفی کم، همواره یکی از پرکاربرد ترین مبدل های آنالوگ به دیحیتال در کاربرد های بایومدیکال بوده اند. به همین دلیل تاکنون روش های متعددی برای کاهش هرچه بیشتر توان مصرفی در این مبدل ها ارائه شده است که در اکثر آنها توجهی به مشخصات سی...
15 صفحه اولSparse-View CT Reconstruction Based on Nonconvex L1 − L2 Regularizations
The reconstruction from sparse-view projections is one of important problems in computed tomography (CT) limited by the availability or feasibility of obtaining of a large number of projections. Traditionally, convex regularizers have been exploited to improve the reconstruction quality in sparse-view CT, and the convex constraint in those problems leads to an easy optimization process. However...
متن کاملAlgorithms for simultaneous sparse approximation. Part II: Convex relaxation
A simultaneous sparse approximation problem requests a good approximation of several input signals at once using different linear combinations of the same elementary signals. At the same time, the problem balances the error in approximation against the total number of elementary signals that participate. These elementary signals typically model coherent structures in the input signals, and they...
متن کاملNonconvex Sorted l1 Minimization for Sparse Approximation
The l1 norm is the tight convex relaxation for the l0 “norm” and has been successfully applied for recovering sparse signals. However, for problems with fewer samples than required for accurate l1 recovery, one needs to apply nonconvex penalties such as lp “norm”. As one method for solving lp minimization problems, iteratively reweighted l1 minimization updates the weight for each component bas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal of Selected Topics in Signal Processing
سال: 2018
ISSN: 1932-4553,1941-0484
DOI: 10.1109/jstsp.2018.2877584